Completeness problem of multidimensional tessellation automata
نویسندگان
چکیده
منابع مشابه
Multidimensional fuzzy finite tree automata
This paper introduces the notion of multidimensional fuzzy finite tree automata (MFFTA) and investigates its closure properties from the area of automata and language theory. MFFTA are a superclass of fuzzy tree automata whose behavior is generalized to adapt to multidimensional fuzzy sets. An MFFTA recognizes a multidimensional fuzzy tree language which is a regular tree language so that for e...
متن کاملReversibility Problem of Multidimensional Finite Cellular Automata
While the reversibility of multidimensional cellular automata is undecidable and there exists a criterion for determining if a multidimensional linear cellular automaton is reversible, there are only a few results about the reversibility problem of multidimensional linear cellular automata under boundary conditions. This work proposes a criterion for testing the reversibility of a multidimensio...
متن کاملThe equivalence problem of multidimensional multitape automata
This article considers the equivalence problem of multitape automata with multidimensional tapes, where the motion of the heads is monotone in all directions (no backward motion). It is shown that this problem can be reduced to the equivalence problem of ordinary multitape automata. Some applications of the result are adduced. © 2008 Elsevier Inc. All rights reserved.
متن کاملDISTINGUISHABILITY AND COMPLETENESS OF CRISP DETERMINISTIC FUZZY AUTOMATA
In this paper, we introduce and study notions like state-\linebreak distinguishability, input-distinguishability and output completeness of states of a crisp deterministic fuzzy automaton. We show that for each crisp deterministic fuzzy automaton there corresponds a unique (up to isomorphism), equivalent distinguished crisp deterministic fuzzy automaton. Finally, we introduce two axioms related...
متن کاملCellular Automata in the Triangular Tessellation
For t he discussion below t he following definit ions are helpful. A semito-talistic CA rule is a rul e for a cellular aut omaton (CA) where (a) we tally t he living neighbors t o a cell without regard to their orient atio n wit h respect t o th at cell, and (b) t he ru le applied t o a cell may depend upon its current status. A lifelike rule (LFR rul e) is a semit otalist ic CA rul e where (1)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1977
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(77)90533-2